Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors
نویسندگان
چکیده
We consider the online scheduling problem of minimizing total weighted flow time plus energy on a processor that can scale its speed dynamically between 0 and some maximum speed T . In the past few years this problem has been studied extensively under the clairvoyant setting, which requires the size of a job to be known when it is released [1, 4, 5, 8, 12, 15, 16, 17]. For the non-clairvoyant setting, despite its practical importance, the progress is relatively limited. Only recently an online algorithm LAPS is known to be O(1)-competitive for minimizing (unweighted) flow time plus energy in the infinite speed model (i.e., T = ∞) [10, 11]. This paper makes two contributions to the non-clairvoyant scheduling. First, we resolve the open problem that the unweighted result of LAPS can be extended to the more realistic model with bounded maximum speed. Second, we show that another non-clairvoyant algorithm WRR is O(1)competitive when weighted flow time is concerned.
منابع مشابه
Scheduling heterogeneous processors isn't as easy as you think
We consider preemptive online scheduling algorithms to minimize the total weighted/unweighted flow time plus energy for speed-scalable heterogeneous multiprocessors. We show that the well-known priority scheduling algorithms Highest Density First, Weighted Shortest Elapsed Time First, and Weighted Late Arrival Processor Sharing, are not O(1)-speed O(1)-competitive for the objective of weighted ...
متن کاملNon-clairvoyant Scheduling for Weighted Flow Time and Energy
We consider the online scheduling problem of minimizing total weighted flow time plus energy in the dynamic speed scaling model, where a processor can scale its speed dynamically between 0 and some maximum speed T . In the past few years this problem has been studied extensively under the clairvoyant setting, which requires the size of a job to be known at release time [1, 4, 5, 8, 15, 18–20]. ...
متن کاملNon-clairvoyant Speed Scaling for Weighted Flow Time
We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow time plus energy to total weighted flow time plus energy. We first consider the non-clairvoyant setting where the size of a job is only known when the job finishes. We show an online algorithm WLAPS that is 8α-competiti...
متن کاملEnergy-efficient multiprocessor scheduling for flow time and makespan
We consider energy-efficient scheduling on multiprocessors, where the speed of each processor can be individually scaled, and a processor consumes power s if it runs at speed s, where α > 1. A scheduling algorithm needs to decide both processor allocations and speeds for a set of parallel jobs whose parallelism can vary with time. The objective is to minimize the sum of overall energy consumpti...
متن کاملSpeed Scaling Functions for Flow Time Scheduling Based on Active Job Count
We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of active jobs, replacing the existing speed scaling functions in the literature that depend on the remaining work of active jobs. The new speed functions are more stable and also more efficient. They can support better job select...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Chicago J. Theor. Comput. Sci.
دوره 2011 شماره
صفحات -
تاریخ انتشار 2010